Construct a Turing machine that accepts the complement of the language L = L (aaaa* b*). The Turing machine must not make any transitions after reaching the final state. Accepted Strings L' = {a, aa, b, ab, aab, aaaba, aaaabba, aaabababb, ...} Rejected Strings L = {ε (empty string), aaa, aaaa, aaaaa, aaaaaa, ..., aaab, aaaab, aaaabb, aaaaabb, ...}